Search results for "Dependent type theory"

showing 3 items of 3 documents

The identity type weak factorisation system

2008

We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.

Class (set theory)Pure mathematicsGeneral Computer ScienceDependent type theoryHomotopiaType (model theory)Identity (music)Theoretical Computer Science510 - Consideracions fonamentals i generals de les matemàtiquesCombinatorics18C50Mathematics::Category TheoryFOS: MathematicsCategory Theory (math.CT)Univalent foundationsAxiomMathematicsHomotopy03B15; 18C50; 18B40Mathematics - Category TheoryIdentity type weak factorisation systemMathematics - LogicTipus Teoria dels03B15Type theory18B40Homotopy type theoryLogic (math.LO)Weak factorisation systemIdentity typeComputer Science(all)
researchProduct

Collection Principles in Dependent Type Theory

2002

We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.

Discrete mathematicsInterpretation (logic)Dependent type theory constructive set theory propositions-as-typesComputer scienceConstructive set theoryIntuitionistic logicIntuitionistic type theoryDependent typeAlgebraMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDependent type theoryType theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceDouble negationSet theoryRule of inferenceAxiom
researchProduct

The generalised type-theoretic interpretation of constructive set theory

2006

We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive instead of being formulated via the propositions-as-types representation. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.

Discrete mathematicsLogicConstructive set theoryType (model theory)Translation (geometry)Constructive Set TheoryInterpretation (model theory)AlgebraPhilosophyType theoryDependent type theoryDependent Type TheoryComputer Science::Logic in Computer Science03F25Constructive set theory Dependent type theoryMathematics03F50
researchProduct